Inexact Version of Bregman Proximal Gradient Algorithm
نویسندگان
چکیده
منابع مشابه
Efficient Inexact Proximal Gradient Algorithm for Nonconvex Problems
The proximal gradient algorithm has been popularly used for convex optimization. Recently, it has also been extended for nonconvex problems, and the current state-of-the-art is the nonmonotone accelerated proximal gradient algorithm. However, it typically requires two exact proximal steps in each iteration, and can be inefficient when the proximal step is expensive. In this paper, we propose an...
متن کاملThe proximal-proximal gradient algorithm
We consider the problem of minimizing a convex objective which is the sum of a smooth part, with Lipschitz continuous gradient, and a nonsmooth part. Inspired by various applications, we focus on the case when the nonsmooth part is a composition of a proper closed convex function P and a nonzero affine map, with the proximal mappings of τP , τ > 0, easy to compute. In this case, a direct applic...
متن کاملAn inexact proximal algorithm for variational inequalities
This paper presents a new inexact proximal method for solving monotone variational inequality problems with a given separable structure. The resulting method combines the recent proximal distances theory introduced by Auslender and Teboulle (2006) with a decomposition method given by Chen and Teboulle that was proposed to solve convex optimization problems. This method extends and generalizes p...
متن کاملConvergence Rates of Inexact Proximal-Gradient Methods for Convex Optimization
We consider the problem of optimizing the sum of a smooth convex function and a non-smooth convex function using proximal-gradient methods, where an error is present in the calculation of the gradient of the smooth term or in the proximity operator with respect to the non-smooth term. We show that both the basic proximal-gradient method and the accelerated proximal-gradient method achieve the s...
متن کاملInexact Halpern-type proximal point algorithm
We present several strong convergence results for the modified, Halpern-type, proximal point algorithm xn+1 = αnu + (1 − αn)Jβn xn + en (n = 0, 1, . . .; u, x0 ∈ H given, and Jβn = (I + βn A)−1, for a maximal monotone operator A) in a real Hilbert space, under new sets of conditions on αn ∈ (0, 1) and βn ∈ (0,∞). These conditions are weaker than those known to us and our results extend and impr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Abstract and Applied Analysis
سال: 2020
ISSN: 1085-3375,1687-0409
DOI: 10.1155/2020/1963980